package TOP101;

/**
 * @Question BM17
 * @Date 2022/11/6 22:52
 * @Solution
 */
public class BM17 {
    public int search (int[] nums, int target) {
        int left=0;
        int right=nums.length-1;
        while(left<right) {
            int mid=(left+right)/2;
            if(nums[mid]==target) {
                return mid;
            } else if(nums[mid]>target) {
                right=mid-1;
            } else if(nums[mid]<target) {
                left=mid+1;
            }
        }
        return -1;
    }
}
